Applied computational geometry: Towards robust solutions of basic problems
نویسندگان
چکیده
منابع مشابه
Graph-Theoretic Solutions to Computational Geometry Problems
Many problems in computational geometry are not stated in graphtheoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm depends on the special properties of the graph constructed in this way. We survey the art gallery problem, partition into rectangles, minimum-diameter clustering, ...
متن کاملBasic Algorithms and Combinatorics in Computational Geometry∗
Computational geometry is, in its broadest sense, the study of geometric problems from a computational point of view. At the core of the field is a set of techniques for the design and analysis of geometric algorithms. These algorithms often operate on, and are guided by, a set of data structures that are ubiquitous in geometric computing. These include arrangements, Voronoi diagrams, and Delau...
متن کاملSome Dynamic Computational Geometry Problems
\‘c consider some problems in computattonal geometry when every one of the input points i\ movmg in a prescribed manner.
متن کاملComputational Geometry Problems in REDLOG
We solve algorithmic geometrical problems in real 3-space or the real plane arising from applications in the area of cad, computer vision, and motion planning. The problems include parallel and central projection problems, shade and cast shadow problems, reconstruction of objects from images, oosets of objects, Voronoi diagrams of a nite families of objects, and collision of moving objects. Our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1990
ISSN: 0022-0000
DOI: 10.1016/0022-0000(90)90019-h